package bintree.leetcode;

public class Num101镜像相同 {
    public boolean isSymmetric(TreeNode root) {
        if (root == null){
            return true;
        }
        //传入两颗子树，就能哦按段这两棵树是否镜像相同
        return isMirror(root.left,root.right);

    }

    private boolean isMirror(TreeNode t1,TreeNode t2){
        if (t1==null&&t2==null){
            return true;
        }
        if (t1 == null||t2 == null){
            return false;
        }
        return t1.val == t2.val&&isMirror(t1.left,t2.right)&&isMirror(t1.right,t2.left);
    }
}
